Automating Quantified Conditional Logics in HOL
نویسنده
چکیده
A notion of quantified conditional logics is provided that includes quantification over individual and propositional variables. The former is supported with respect to constant and variable domain semantics. In addition, a sound and complete embedding of this framework in classical higherorder logic is presented. Using prominent examples from the literature it is demonstrated how this embedding enables effective automation of reasoning within (object-level) and about (meta-level) quantified conditional logics with off-the-shelf higherorder theorem provers and model finders.
منابع مشابه
Tutorial on Reasoning in Expressive Non-Classical Logics with Isabelle/HOL
Non-classical logics (such as modal logics, description logics, conditional logics, multi-valued logics, hybrid logics, etc.) have many applications in artificial intelligence. In this tutorial, we will demonstrate a generic approach to automate propositional and quantified variants of non-classical logics using theorem proving systems for classical higher-order logic. Our particular focus will...
متن کاملQuantified Conditional Logics are Fragments of HOL
A semantic embedding of propositional conditional logic in classical higher-order logic HOL (Church’s type theory) has been presented in [3]. This embedding exploits the natural correspondence between selection function semantics for conditional logics [10] and HOL. In fact, selection function semantics can be seen as an higher-order extension of well-known Kripke semantics for modal logic and ...
متن کاملHOL based Universal Reasoning
At Unilog’2010 I have proposed classical higher-order logic HOL (Church’s type theory [1,9]) as a uniform framework for combining logics [2]. The main claim has been that many non-classical logics are just natural (embedded) fragments of classical HOL. The approach also supports combinations (e.g. fusions) of embedded logics; in particular, bridge rules can be postulated simply as axioms. In th...
متن کاملEmbedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol Embedding a Formal Notation: Experiences of Automating the Embedding of Z in the Higher Order Logics of Pvs and Hol
In this paper, we consider the problem of embedding formal notations. In particular, we describe our experiences of automating the embedding of Z speciications into the notations of the PVS and HOL theorem provers. This paper is motivated by our experiences of constructing a prototype tool for embedding formal notations and its use in automating an embedding of Z and AMN into the notations of P...
متن کاملAutomating Algebraic Methods in Isabelle
We implement a large Isabelle/HOL repository of algebras for application in modelling computing systems. They subsume computational logics such as dynamic and Hoare logics and form a basis for various software development methods. Isabelle has recently been extended by automated theorem provers and SMT solvers. We use these integrated tools for automatically proving several rather intricate ref...
متن کامل